UNE FORME CANONIQUE POUR LES GRAMMAIRES SIMPLES DETERMINISTESCOURCELLE B.REVUE FRANCAISE D'AUTOMATIQUE. RECHERCHE OPERATIONNELLE ANC REVUE FRANCAISE D'INFORMATIQUE ET DE RECHERCHE OPERATIONNELLE. 1974, Vol 8, pp 19-36Article

FUNDAMENTAL PROPERTIES OF INFINITE TREESCOURCELLE B.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 25; NO 2; PP. 95-169; BIBL. 70 REF.Article

A REPRESENTATION OF TREES BY LANGUAGES IICOURCELLE B.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 1; PP. 25-55; BIBL. 33 REF.Article

ON JUMP-DETERMINISTIC PUSDOWN AUTOMATACOURCELLE B.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 2; PP. 87-109; BIBL. 26 REF.Article

RECURSIVE SCHEMES ALGEBRAIC TREES AND DETERMINISTIC LANGUAGES.COURCELLE B.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 78; PP. 1-11; ABS. FR.; BIBL. 12 REF.Article

ON RECURSIVE EQUATIONS HAVING A UNIQUE SOLUTION.COURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 285; PP. 1-55; ABS. FR.; BIBL. 2 P.Serial Issue

UNE FORME CANONIQUE POUR LES GRAMMAIRES SIMPLES DETERMINISTES.COURCELLE B.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 1; PP. 19-36; ABS. ANGL.; BIBL. 3 REF.Article

FRONTIERS OF INFINITE TREES.COURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 272; PP. 1-26; ABS. FR.; BIBL. 6 REF.Serial Issue

ARBRES INFINIS ET SYSTEMES D'EQUATIONSCOURCELLE B.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1978; NO 328; PP. 1-26; ABS. ENG; BIBL. 15 REF.Serial Issue

The monadic second-order logic of graphs. XIII : Graph drawings with edge crossingsCOURCELLE, B.Theoretical computer science. 2000, Vol 244, Num 1-2, pp 63-94, issn 0304-3975Article

Monadic second-order definable graph transductions: a surveyCOURCELLE, B.Theoretical computer science. 1994, Vol 126, Num 1, pp 53-75, issn 0304-3975Conference Paper

Some negative results concerning DPDÁsCOURCELLE, B.Information processing letters. 1984, Vol 18, Num 5, pp 285-289, issn 0020-0190Article

SEMANTICS AND AXIOMATICS OF A SIMPLE RECURSIVE LANGUAGE.COURCELLE B; VUILLEMIN J.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 60; PP. 1-14; BIBL. 28 REF.Article

PROGRAM EQUIVALENCE AND CANONICAL FORMS IN STABLE DISCRETE INTERPRETATIONS.BERRY G; COURCELLE B.sdIN: JOURN. ET. SCHEMAS PROGRAMME SEMANTIQUE LANG. PROGRAMMATION; MOLINES EN QUEYRAS; 1976; S.L.; DA. S.D.; PP. 1-21; BIBL. 13 REF.Conference Paper

Structural properties of context-free sets of graphs generated by vertex replacementCOURCELLE, B.Information and computation (Print). 1995, Vol 116, Num 2, pp 275-293, issn 0890-5401Article

The monadic second-order logic of graphs. I, Recognizable sets of finite graphsCOURCELLE, B.Information and computation (Print). 1990, Vol 85, Num 1, pp 12-75, issn 0890-5401Article

The monadic second-order logic of graphs. II: infinite graphs of bounded widthCOURCELLE, B.Mathematical systems theory. 1989, Vol 21, Num 4, pp 187-221, issn 0025-5661Article

THE ALGEBRAIC SEMANTICS OF RECURSIVE PROGRAM SCHEMES.COURCELLE B; NIVAT M.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1978; NO 300; PP. 1-15; ABS. FR.; BIBL. 2 P.Serial Issue

ALGEBRAIC FAMILIES OF INTERPRETATIONS.COURCELLE B; NIVAT M.1976; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1976; NO 189; PP. 1-10; ABS. FR.; BIBL. 11 REF.Serial Issue

The monadic second-order logic of graphs IV: definability properties of equational graphsCOURCELLE, B.Annals of pure and applied logic. 1990, Vol 49, Num 3, pp 193-255, issn 0168-0072, 63 p.Article

COMPLETUDE D'UN SYSTEME FORMEL POUR PROUVER L'EQUIVALENCE DE CERTAINS SCHEMAS RECURSIFS MONADIQUES.COURCELLE B; VUILLEMIN J.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 63; PP. 1-19; ABS. ANGL.; BIBL. 8 REF.Article

ALGEBRAIC FAMILIES OF INTERPRETATIONS.COURCELLE B; NIVAT M.sdIN: JOURN. ET. SCHEMAS PROGRAMME SEMANTIQUE LANG. PROGRAMMATION; MOLINES EN QUEYRAS; 1976; S.L.; DA. S.D.; PP. 1-9; BIBL. 7 REF.Conference Paper

Monadic second-order evaluations on tree-decomposable graphsCOURCELLE, B; MOSBAH, M.Theoretical computer science. 1993, Vol 109, Num 1-2, pp 49-82, issn 0304-3975Conference Paper

ATTRIBUTE GRAMMARS AND RECURSIVE PROGRAM SCHEMES IICOURCELLE B; FRANCHI ZANNETTACCI P.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 235-257; BIBL. 25 REF.Article

ATTRIBUTE GRAMMARS AND RECURSIVE PROGRAM SCHEMESCOURCELLE B; FRANCHI ZANNETTACCI P.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 163-191; BIBL. 26 REF.Article